Sliding-Window Thompson Sampling for Non-Stationary Settings
نویسندگان
چکیده
منابع مشابه
Active Search for High Recall: A Non-stationary Extension of Thompson Sampling
We consider the problem of Active Search, where a maximum of relevant objects ideally all relevant objects should be retrieved with the minimum effort or minimum time. Typically, there are two main challenges to face when tackling this problem: first, the class of relevant objects has often low prevalence and, secondly, this class can be multifaceted or multi-modal: objects could be relevant fo...
متن کاملRacing Thompson: an Efficient Algorithm for Thompson Sampling with Non-conjugate Priors
Thompson sampling has impressive empirical performance for many multi-armed bandit problems. But current algorithms for Thompson sampling only work for the case of conjugate priors since these algorithms require to infer the posterior, which is often computationally intractable when the prior is not conjugate. In this paper, we propose a novel algorithm for Thompson sampling which only requires...
متن کاملThompson Sampling for Dynamic Pricing
In this paper we apply active learning algorithms for dynamic pricing in a prominent e-commerce website. Dynamic pricing involves changing the price of items on a regular basis, and uses the feedback from the pricing decisions to update prices of the items. Most popular approaches to dynamic pricing use a passive learning approach, where the algorithm uses historical data to learn various param...
متن کاملNon-stationary forward flux sampling.
We present a method, Non-Stationary Forward Flux Sampling, that allows efficient simulation of rare events in both stationary and non-stationary stochastic systems. The method uses stochastic branching and pruning to achieve uniform sampling of trajectories in phase space and time, leading to accurate estimates for time-dependent switching propensities and time-dependent phase space probability...
متن کاملFreshness-Aware Thompson Sampling
To follow the dynamicity of the user’s content, researchers have recently started to model interactions between users and the ContextAware Recommender Systems (CARS) as a bandit problem where the system needs to deal with exploration and exploitation dilemma. In this sense, we propose to study the freshness of the user’s content in CARS through the bandit problem. We introduce in this paper an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2020
ISSN: 1076-9757
DOI: 10.1613/jair.1.11407